Computability of a topological poset

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological Aspects of Poset Spaces

We study two classes of spaces whose points are filters on partially ordered sets. Points in MF spaces are maximal filters, while points in UF spaces are unbounded filters. We give a thorough account of the topological properties of these spaces. We obtain a complete characterization of the class of countably based MF spaces: they are precisely the second-countable T1 spaces with the strong Cho...

متن کامل

Poset models of topological spaces

We consider poset models of topological spaces and show that every T1-space has an bounded complete algebraic poset model, thus give a positive answer to a question asked in a recent paper by Waszkiewicz. It is also proved that every T1-space is homeomorphic to the maximal point space of a d-space. In the classic general topology, people are mainly interested in the spaces which satisfy at leas...

متن کامل

On the Computability of the Topological Entropy of Subshifts

We prove that the topological entropy of subshifts having decidable language is uncomputable in the following sense: For no error bound less than 1/4 does there exists a program that, given a decision procedure for the language of a subshift as input, will approximate the entropy of the subshift within the error bound. In addition, we prove that not only is the topological entropy of sofic shif...

متن کامل

Computability of semicomputable manifolds in computable topological spaces

We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold M is computable if its boundary ∂M is computable. We also show how this result combined with certain construction which compactifies a semicomputable set leads to th...

متن کامل

A Finite Word Poset

Our word posets have finite words of bounded length as their elements, with the words composed from a finite alphabet. Their partial ordering follows from the inclusion of a word as a subsequence of another word. The elemental combinatorial properties of such posets are established. Their automorphism groups are determined (along with similar result for the word poset studied by Burosch, Frank ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2006

ISSN: 0166-8641

DOI: 10.1016/j.topol.2005.03.004